Monte Carlo algorithms: performance analysis for some computer architectures
نویسندگان
چکیده
منابع مشابه
Population Monte Carlo algorithms
We give a cross-disciplinary survey on “population” Monte Carlo algorithms. In these algorithms, a set of “walkers” or “particles” is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by lots of different terms – ...
متن کاملMonte-Carlo Search Algorithms
We have explored and tested the behavior of Monte-Carlo Search Algorithms in both artificial and real game trees. Complementing the work of previous WPI students, we have expanded the Gomba Testing Framework; a platform for the comparative evaluation of search algorithms in large adversarial game trees. We implemented and analyzed the specific UCT algorithm PoolRAVE by developing and testing va...
متن کاملEvaluating Performance of Algorithms in Lung IMRT: A Comparison of Monte Carlo, Pencil Beam, Superposition, Fast Superposition and Convolution Algorithms
Background: Inclusion of inhomogeneity corrections in intensity modulated small fields always makes conformal irradiation of lung tumor very complicated in accurate dose delivery.Objective: In the present study, the performance of five algorithms via Monte Carlo, Pencil Beam, Convolution, Fast Superposition and Superposition were evaluated in lung cancer Intensity Modulated Radiotherapy plannin...
متن کاملMonte-Carlo methods for Computer Vision
In figure 1, suppose we are throwing darts to each of the Cartesian systems. The probability of a dart falling anywhere in the red area is easy to compute when we are dealing with analytical shapes such as a rectangle or a circle; but how do we compute the probability of success in the third case? One approach is the Riemann integration method by separating the whole system into a thin grid and...
متن کاملFast Monte Carlo Algorithms for Tensor Operations
We consider scalable randomized algorithms for many common tensor operations, including tensor multiplication, low-rank decomposition and nuclear norm minimization. Such operations arise in a number of modern day applications of tensors in machine learning and signal processing. Specifically, we introduce polynomial time algorithms that employ a small number of lateral and/or horizontal slices ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1993
ISSN: 0377-0427
DOI: 10.1016/0377-0427(93)90024-6